Towards balanced clustering - part 1 (preliminaries)
نویسنده
چکیده
The article contains a preliminary glance at balanced clustering problems. Basic balanced structures and combinatorial balanced problems are briefly described. A special attention is targeted to various balance/unbalance indices (including some new versions of the indices): by cluster cardinality, by cluster weights, by inter-cluster edge/arc weights, by cluster element structure (for element multi-type clustering). Further, versions of optimization clustering problems are suggested (including multicriteria problem formulations). Illustrative numerical examples describe calculation of balance indices and element multi-type balance clustering problems (including example for design of student teams).
منابع مشابه
Contents I Part A 7 1 Clustering with Balancing Constraints 9
In many applications of clustering, solutions that are balanced, i.e, where the clusters obtained are of comparable sizes, are preferred. This chapter describes several approaches to obtaining balanced clustering results that also scale well to large data sets. First, we describe a general scalable framework for obtaining balanced clustering which first clusters only a small subset of the data ...
متن کاملApplication of modified balanced iterative reducing and clustering using hierarchies algorithm in parceling of brain performance using fMRI data
Introduction: Clustering of human brain is a very useful tool for diagnosis, treatment, and tracking of brain tumors. There are several methods in this category in order to do this. In this study, modified balanced iterative reducing and clustering using hierarchies (m-BIRCH) was introduced for brain activation clustering. This algorithm has an appropriate speed and good scalability in dealing ...
متن کاملLinear Series on Semistable Curves
We study h 0 (X, L) for line bundles L on a semistable curve X of genus g, parametrized by the compactified Picard scheme. The theorem of Riemann is shown to hold. The theorem of Clifford is shown to hold in the following cases: X has two components; X is any semistable curve and d = 0 or d = 2g − 2; X is stable, free from separating nodes, and d ≤ 4. These results are shown to be sharp. Applic...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملSpectral Clustering, Markov Chains, and the Multicut Lemma
1 Preliminaries In the following, W will be a symmetric n × n matrix with non-negative elements. The assumption is that W ij are weights corresponding to the edges ij of a (complete) graph (V, E) with vertices indexed by the numbers 1,. .. n. The indices k, l will be used to index subsets of V in a partition; we will call these subsets clusters. The indices i, j will index elements of V .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.03065 شماره
صفحات -
تاریخ انتشار 2017